Inverse problems for ergodicity of Markov chains

نویسندگان

چکیده

For continuous-time Markov chains, we provide criteria for non-ergodicity, non-algebraic ergodicity, non-exponential and non-strong ergodicity. discrete-time ergodicity are given. Our in terms of the existence solutions to inequalities involving Q-matrix (or transition matrix P time-discrete case) chain. Meanwhile, these practical applied some examples, including a special class single birth processes several multi-dimensional models.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgeometric ergodicity of Markov chains

When f ≡ 1, the f -norm is the total variation norm, which is denoted ‖μ‖TV. Assume that P is aperiodic positive Harris recurrent with stationary distribution π. Then the iterated kernels P(x, ·) converge to π. The rate of convergence of P(x, .) to π does not depend on the starting state x, but exact bounds may depend on x. Hence, it is of interest to obtain non uniform or quantitative bounds o...

متن کامل

Geometric Ergodicity and Hybrid Markov Chains

Various notions of geometric ergodicity for Markov chains on general state spaces exist. In this paper, we review certain relations and implications among them. We then apply these results to a collection of chains commonly used in Markov chain Monte Carlo simulation algorithms, the so-called hybrid chains. We prove that under certain conditions, a hybrid chain will “inherit” the geometric ergo...

متن کامل

Discrete Time Markov Chains : Ergodicity Theory

Lecture 8: Discrete Time Markov Chains: Ergodicity Theory Announcements: 1. We handed out HW2 solutions and your homeworks in Friday’s recitation. I am handing out a few extras today. Please make sure you get these! 2. Remember that I now have office hours both: Wednesday at 3 p.m. and Thursday at 4 p.m. Please show up and ask questions about the lecture notes, not just the homework! No one cam...

متن کامل

Reachability problems for Markov chains

We consider the following decision problem: given a finite Markov chain with distinguished source and target states, and given a rational number r, does there exist an integer n such that the probability to reach the target from the source in n steps is r? This problem, which is not known to be decidable, lies at the heart of many model checking questions on Markov chains. We provide evidence o...

متن کامل

Extremal Indices, Geometric Ergodicity of Markov Chains, and Mcmc

We investigate the connections between extremal indices on the one hand and stability of Markov chains on the other hand. Both theories relate to the tail behaviour of stochastic processes, and we find a close link between the extremal index and geometric ergodicity. Our results are illustrated throughout with examples from simple MCMC chains.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2022

ISSN: ['0022-247X', '1096-0813']

DOI: https://doi.org/10.1016/j.jmaa.2021.125483